Using Conditional Branches to Improve Constant Propagation
نویسندگان
چکیده
منابع مشابه
Ibm Research Report Combining Interprocedural Pointer Analysis and Conditional Constant Propagation Combining Interprocedural Pointer Analysis and Conditional Constant Propagation ?
LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and spe...
متن کاملPerceptron Learning for Predicting the Behavior of Conditional Branches
Branch prediction, i.e., predicting the outcome of a conditional branch instruction, is essential to the performance of current and future microprocessors. We show how perceptrons can be used to improve the state of the art in branch prediction. We explore the unusual challenges this domain presents for neural systems, and we show why other neural methods, such as back-propagation, provide no a...
متن کاملComplex Branch Profiling for Dynamic Conditional Execution
Branch predictors are widely used as an alternative to deal with conditional branches. Despite the high accuracy rates, misprediction penalties are still large in any superscalar pipeline. DCE, or Dynamic Conditional Execution, is a alternative to reduce the number of predicted branches by executing both paths of certain branches thus reducing the number of predictions and therefore the mispred...
متن کاملEnabling Sparse Constant Propagation of Array Elements via Array SSA Form
We present a new static analysis technique based on Array SSA form [6]. Compared to traditional SSA form, the key enhancement in Array SSA form is that it deals with arrays at the element level instead of as monolithic objects. In addition, Array SSA form improves the φ function used for merging scalar or array variables in traditional SSA form. The computation of a φ function in traditional SS...
متن کاملParallel Static Single Assignment Form and Constant Propagation for Explicitly Parallel Programs
Static Single Assignment (SSA) form has shown its usefulness for powerful code optimization techniques, such as constant propagation, of sequential programs. We introduce a new Parallel Static Single Assignment (PSSA) form and the transformation algorithm for the explicitly parallel programs with interleaving semantics and post-wait synchronization. The parallel construct considered in this pap...
متن کامل